A Mealy Machine with Polynomial Growth of Irrational Degree

نویسندگان

  • Laurent Bartholdi
  • Illya I. Reznykov
چکیده

We consider a very simple Mealy machine (two non-trivial states over a two-symbol alphabet), and derive some properties of the semigroup it generates. It is an infinite, finitely generated semigroup, and we show that the growth function of its balls behaves asymptotically like nα, for α = 1 + log 2/log 1+ √ 5 2 ; that the semigroup satisfies the identity g = g; and that its lattice of two-sided ideals is a chain.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Composite and Non-monotonic Growth Functions of Mealy Automata

Abstract. We introduce the notion of composite growth function and provide examples that illustrate the primary properties of these growth functions. There are provided examples of Mealy automata that have composite nonmonotonic growth functions of the polynomial growth order. There are described examples of Mealy automata that have composite monotonic growth functions of intermediate and expon...

متن کامل

Inferring Non-resettable Mealy Machines with n States

Automata inference algorithms are used to extract behavioural models of software components. However, when the software system cannot be reset, inference must be done from a single trace. This paper proposes an active learning algorithm that can infer a Mealy model under the assumption that the number of the states of the machine is known and that a characterization set for it is provided. This...

متن کامل

Automaton (semi)groups: Wang tilings and Schreier tries

Groups and semigroups generated by Mealy automata were formally introduced in the early sixties. They revealed their full potential over the years, by contributing to important conjectures in group theory. In the current chapter, we intend to provide various combinatorial and dynamical tools to tackle some decision problems all related to some extent to the growth of automaton (semi)groups. In ...

متن کامل

On level-transitivity and exponential growth

We prove that if the group generated by an invertible and reversible Mealy automaton acts level-transitively on a regular rooted tree, then the semigroup generated by the dual automaton has exponential growth, hence giving a decision procedure of exponential growth for a restricted family of automaton (semi)groups. The purpose of this note is to link up two classes of groups and semigroups high...

متن کامل

To Infinity and Beyond

We prove that if a group generated by a bireversible Mealy automaton contains an element of infinite order, its growth blows up and is necessarily exponential. As a direct consequence, no infinite virtually nilpotent group can be generated by a bireversible Mealy automaton. The study on how (semi)groups grow has been highlighted since Milnor’s question on the existence of groups of intermediate...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IJAC

دوره 18  شماره 

صفحات  -

تاریخ انتشار 2008